Abelian pattern avoidance in partial words
نویسندگان
چکیده
منابع مشابه
Abelian Pattern Avoidance in Partial Words
Pattern avoidance is an important topic in combinatorics on words which dates back to the beginning of the twentieth century when Thue constructed an infinite word over a ternary alphabet that avoids squares, i.e., a word with no two adjacent identical factors. This result finds applications in various algebraic contexts where more general patterns than squares are considered. On the other hand...
متن کاملUnary Pattern Avoidance in Partial Words Dense with Holes
A partial word is a sequence of symbols over a finite alphabet that may have some undefined positions, called holes, that match every letter of the alphabet. Previous work completed the classification of all unary patterns with respect to partial word avoidability, as well as the classification of all binary patterns with respect to non-trivial partial word avoidability. In this paper, we pose ...
متن کاملAbelian-primitive partial words
In this paper we count the number of abelian-primitive partial words of a given length over a given alphabet size, which are partial words that are not abelian powers. Partial words are sequences that may have undefined positions called holes. This combinatorial problem was considered recently for full words (those without holes). It turns out that, even for the full word case, it is a nontrivi...
متن کاملAbelian Repetitions in Partial Words∗
We study abelian repetitions in partial words, or sequences that may contain some unknown positions or holes. First, we look at the avoidance of abelian pth powers in infinite partial words, where p > 2, extending recent results regarding the case where p = 2. We investigate, for a given p, the smallest alphabet size needed to construct an infinite partial word with finitely or infinitely many ...
متن کاملAbelian Square-Free Partial Words
Erdös raised the question whether there exist infinite abelian square-free words over a given alphabet (words in which no two adjacent subwords are permutations of each other). Infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words (sequences that may contain some h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2014
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2014014